Towards process design for efficient organisational problem solving
نویسندگان
چکیده
This paper presents initial results on stochastic business process modelling. We interpret business processes as problem solving processes to show that certain trade-offs in stakeholder involvement can usefully be analysed. Our initial results illustrate the analytic potential of our stochastic model, which could be useful to business process analysts and designers. Keywords-process modelling; business process design; Problem Oriented Engineering
منابع مشابه
Organisational Intelligence and Distributed AI
The analysis of this chapter starts from organisational theory, and from this it draws conclusions for the design, and possible organisational applications, of Distributed AI systems. We first review how the concept of organisations has emerged from non-organised "blackbox" entities to so-called "computerised" organisations. Within this context, organisational researchers have started to redesi...
متن کاملUsability in the Organisational Context: a Semiotic- Participatory Approach
Usability engineering represents a general framework for thinking about the design of usable systems. Nevertheless, the usability of a product is strongly determined by the social and cultural contexts of prospective users. In this paper we draw upon Organisational Semiotics and Participatory Design to promote the usability of systems designed for the context of work in organisations. Our appro...
متن کاملClarifying the role of the creative problem solving process on improving the competitiveness of architectural design
Introduction: As a cognitive activity, the process of creative problem solving plays a crucial role in architectural design. The design method includes the emergence, evolution, and transformation of ideas and the formation of concepts. Explaining the most important influential components of creativity and contestability of design raises these concepts in achieving each one of the approaches. T...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کامل